Efficient Pairing-Free Attribute-Based Blind Signature Scheme Based on Ordered Binary Decision Diagram
نویسندگان
چکیده
Attribute-based blind signature is used to realize the of messages by multiple people, and it suitable for electronic payment services in cloud. Most existing attribute-based schemes have complex bilinear pairing operations process verification, which leads low algorithm efficiency. To solve this problem, study, an efficient pairing-free scheme based on ordered binary decision diagram proposed, security analysis new given under difficulty elliptic curve discrete logarithm problem (ECDLP). The proposed cryptography (ECC). In scheme, scalar multiplication curve, relatively lightweight, replace with a large computational cost traditional schemes. overhead verification processes reduced, making solution more resource-constrained cloud terminal user scenarios. On other hand, order improve efficiency expressive computationally (OBDD) structure construct access signer. OBDD can simultaneously support positive negative values attributes at same time. Compared schemes, has better performance storage, meets needs end users.
منابع مشابه
An efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملA Pairing-based Blind Signature Scheme with Message Recovery
Blind signatures enable users to obtain valid signatures for a message without revealing its content to the signer. This paper presents a new blind signature scheme, i.e. identity-based blind signature scheme with message recovery. Due to the message recovery property, the new scheme requires less bandwidth than the identitybased blind signatures with similar constructions. The scheme is based ...
متن کاملID-based Threshold Blind Signature scheme from Bilinear Pairing
Threshold and Blindness are two important properties in cryptography system. They can provide security and privacy. In this paper, We present an efficient construction from Bilinear pairing in an ID-based cryptography system. In an ID-based (k, n) threshold blind signature scheme, Private Key Generation Center(PKGC) distributes the secret key to n group members. The user only communicates with ...
متن کاملAttribute Based Group Signature Scheme
Alice needs a document signed by an employee in Bob’s company. That employee should be part of the IT staff and is at least a junior manager in the cryptography team or a senior manager in the biometrics team. In such a scenario we need an Attribute Based Group Signature Scheme (ABGS). In this paper we define the first ABGS scheme where verifying includes authenticating a person that belongs to...
متن کاملan Efficient Blind Signature Scheme based on Error Correcting Codes
Cryptography based on the theory of error correcting codes and lattices has received a wide attention in the last years. Shor’s algorithm showed that in a world where quantum computers are assumed to exist, number theoretic cryptosystems are insecure. Therefore, it is important to design suitable, provably secure post-quantum signature schemes. Code-based public key cryptography has the charact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3217907